Spatial Join

نویسنده

  • Biplob Kumar Debnath
چکیده

DEFINITION Spatial join operation is used to combine two or more datasets with respect to a spatial predicate. The predicate can be a combination of directional, distance, and topological spatial relations. In the case of nonspatial joins, the joining attributes must be of the same type, but for spatial joins they can be of different types. Usually each spatial attribute is represented by its minimum bounding rectangles (MBR).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distance-Associated Join Indices for Spatial Range Search

Spatial join indices are join indices constructed for spatial objects. Similar to join indices for relational database systems, spatial join indices improve efficiency of spatial join operations. In this paper, a distanceassociated join index structure is developed to speed up spatial queries especially for spatial range queries. Three distance-associated join indexing mechanisms: basic, ring-s...

متن کامل

In-Memory Spatial Join: The Data Matters!

A spatial join computes all pairs of spatial objects in two data sets satisfying a distance constraint. An increasing demand in applications ranging from human brain analysis to transportation data analysis motivates studies on designing new in-memory spatial join algorithms. Among recent proposals, the following six algorithms can efficiently perform in-memory spatial joins: Size Separation Sp...

متن کامل

Spatial Join with R-Tree on Graphics Processing Units

Spatial operations such as spatial join combine two objects on spatial predicates. It is different from relational join because objects have multi dimensions and spatial join consumes large execution time. Recently, many researches tried to find methods to improve the execution time. Parallel spatial join is one method to improve the execution time. Comparison between objects can be done in par...

متن کامل

A Review of Heuristics for Optimal Page Access Sequence with a Model for Spatial Queries

Spatial Database Systems are very large databases requiring storage in disk devices. The join process between two relations that is based on spatial nature of the attributes needs repeated and redundant disk accesses. This necessitates the implementation of join index which accelerates the join processing between two relations and it incurs high over head. This work studies the heuristics that ...

متن کامل

Adaptive and Incremental Processing for Distance Join Queries

A spatial distance join is a relatively new type of operation introduced for spatial and multimedia database applications. Additional requirements for ranking and stopping cardinality are often combined with the spatial distance join in on-line query processing or internet search environments. These requirements pose new challenges as well as opportunities for more efficient processing of spati...

متن کامل

To appear in SIGMOD 1996 1 Partition Based Spatial – Merge Join

This paper describes PBSM (Partition Based Spatial–Merge), a new algorithm for performing spatial join operation. This algorithm is especially effective when neither of the inputs to the join have an index on the joining attribute. Such a situation could arise if both inputs to the join are intermediate results in a complex query, or in a parallel environment where the inputs must be dynamicall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006